Graphings and graph sequences
نویسنده
چکیده
We prove that for any weakly convergent sequence of finite graphs with bounded vertex degrees, there exists a limit graphing. The spectral measure of the Laplacian on the limit graphing is the weak limit of the spectral measures of the Laplacians of the finite graphs. AMS Subject Classifications: 05C80
منابع مشابه
Limits of local-global convergent graph sequences
The colored neighborhood metric for sparse graphs was introduced by Bollobás and Riordan [8]. The corresponding convergence notion refines a convergence notion introduced by Benjamini and Schramm [6]. We prove that even in this refined sense, the limit of a convergent graph sequence (with uniformly bounded degree) can be represented by a graphing. We study various topics related to this converg...
متن کاملKőnig’s Line Coloring and Vizing’s Theorems for Graphings
The classical theorem of Vizing states that every graph of maximum degree d admits an edge-coloring with at most d + 1 colors. Furthermore, as it was earlier shown by Kőnig, d colors suffice if the graph is bipartite. We investigate the existence of measurable edge-colorings for graphings. A graphing is an analytic generalization of a bounded-degree graph that appears in various areas, such as ...
متن کاملInteraction Graphs: Graphings
In two previous papers [Sei12b, Sei12a], we exposed a combinatorial approach to the program of Geometry of Interaction, a program initiated by Jean-Yves Girard [Gir89b]. The strength of our approach lies in the fact that we interpret proofs by simpler structures — graphs — than Girard’s constructions, while generalizing the latter since they can be recovered as special cases of our setting. Thi...
متن کاملMalware Detection using Classification of Variable-Length Sequences
In this paper, a novel method based on the graph is proposed to classify the sequence of variable length as feature extraction. The proposed method overcomes the problems of the traditional graph with variable length of data, without fixing length of sequences, by determining the most frequent instructions and insertion the rest of instructions on the set of “other”, save speed and memory. Acco...
متن کاملClustering of Short Read Sequences for de novo Transcriptome Assembly
Given the importance of transcriptome analysis in various biological studies and considering thevast amount of whole transcriptome sequencing data, it seems necessary to develop analgorithm to assemble transcriptome data. In this study we propose an algorithm fortranscriptome assembly in the absence of a reference genome. First, the contiguous sequencesare generated using de Bruijn graph with d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005